Lazy productivity via termination
نویسندگان
چکیده
منابع مشابه
Lazy productivity via termination
We present a procedure for transforming strongly sequential constructor-based term rewriting systems (TRSs) into context-sensitive TRSs in such a way that productivity of the input system is equivalent to termination of the output system. Thereby automated termination provers become available for proving productivity. A TRS is called productive if all its finite ground terms are constructor nor...
متن کاملTermination of Lazy Rewriting Revisited
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to context-sensitive rewriting, reductions at such argument positions are not completely forbidden but delayed. Based on the observation that the only existing (non-trivial) approach to prove termination of such lazy rewr...
متن کاملTermination and Productivity
We present a method for automatically proving termination ofterm rewriting. It is based on the well-known idea of interpretation ofterms where every rewrite step causes a decrease, but instead of the usualnatural numbers we use vectors of natural numbers, ordered by a parti-cular non-total well-founded ordering. Function symbols are interpretedby linear mappings represented ...
متن کاملLazy Abstraction for Size-Change Termination
Size-change termination is a widely used means of proving termination where source programs are first abstracted to size-change graphs which are then analyzed to determine if they satisfy the sizechange termination property. Here, the choice of the abstraction is crucial to the success of the method, and it is an open problem how to choose an abstraction such that no critical loss of precision ...
متن کاملStream Productivity by Outermost Termination
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. A core property is productivity: unfolding the equations produces the intended stream in the limit. In this paper we show that productivity is equivalent to termination with respect to the balanced outermost strategy of a TRS obtained by adding an additional rule. For...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.03.024